MinPos : A Novel Frontier Allocation Algorithm for Multi-robot Exploration
نویسندگان
چکیده
Exploring an unknown environment with multiple robots requires an efficient coordination method to minimize the total duration. A standard method to discover new areas is to assign frontiers (boundaries between unexplored and explored accessible areas) to robots. In this context, the frontier allocation method is paramount. This paper introduces a decentralized and computationally efficient frontier allocation method favoring a well balanced spatial distribution of robots in the environment. For this purpose, each robot evaluates its relative rank among the other robots in term of travel distance to each frontier. Accordingly, robots are allocated to the frontier for which it has the lowest rank. To evaluate this criteria, a wavefront propagation is computed from each frontier giving an interesting alternative to path planning from robot to frontiers. Comparisons with existing approaches in computerized simulation and on real robots demonstrated the validity and efficiency of our algorithm.
منابع مشابه
Towards a communication free coordination for multi-robot exploration
Frontier-based exploration method are known to be efficient for multi-robot exploration systems. In this paper, we propose a novel, computationally inexpensive, frontier allocation method favoring a well balanced spatial distribution of robots in the environment. It is based on the computation of a position criteria. The position of a robot towards a frontier is defined by the number of robots ...
متن کاملStratégie d'exploration multi-robot fondée sur les champs de potentiels artificiels
The context of this work is multi-robot exploration and mapping of unknown environments. Frontiers (boundaries between empty and unexplored areas) are points to go to in order to increase explored area. In this paper, we propose a frontier allocation method for the exploration and mapping of indoor environments using multiple robots. A wavefront propagation algorithm is used to build a local mi...
متن کاملComparison of Task-Allocation Algorithms in Frontier-Based Multi-robot Exploration
In this paper, we address the problem of efficient allocation of the navigational goals in the multi-robot exploration of unknown environment. Goal candidate locations are repeatedly determined during the exploration. Then, the assignment of the candidates to the robots is solved as the task-allocation problem. A more frequent decision-making may improve performance of the exploration, but in a...
متن کاملMulti Robot Area Exploration Using Modified Frontier Algorithm
Area exploration in robotics is done by number of methods some of which select next target based on shortest distance, other uses utility function and the most frequently used method is through frontier based area exploration which is boundary between explored and unexplored cells. In view of Multi robot, extra care should be taken as it may possible that two robot may collide or explore alread...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کامل